-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSingly Circular Linked List - Linear Search - based on user input.cpp
89 lines (81 loc) · 2.09 KB
/
Singly Circular Linked List - Linear Search - based on user input.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>
using namespace std;
struct NODE {
int data;
NODE *next;
};
NODE *head, *tail, *temp;
void add(int value){
if(head == NULL){
head = tail = new NODE;
head->data = value;
head->next = tail;
} else {
tail->next = new NODE;
tail = tail->next;
tail->data = value;
tail->next = head;
}
}
void linearSearch(int search){
if(head == 0){
cout << "A search couldn't be completed in an empty list.";
} else {
temp = head;
int result = 0, i = 1;
do {
if(temp->data == search){
result = i;
break;
}
temp = temp->next;
i++;
} while(temp != head);
if(result > 0){
cout << "The value [" << search << "] is matched with the [NODE-" << result << "]";
} else {
cout << "The value [" << search << "] didn't match with any node in the list.";
}
}
}
int print(NODE *ref){
if(ref == 0){
cout << "[EMPTY LIST]" << endl;
return false;
} else {
do {
cout << ref->data;
ref = ref->next;
if(ref != head) cout << " => ";
} while(ref != head);
cout << endl;
return true;
}
}
int main(){
cout << "Note! Enter zero (0) to exit from entering input. " << endl;
int input = 1, i = 0;
while(input != 0){
cout << "Enter a value for the NODE-" << ++i << ": ";
cin >> input;
if(input != 0) add(input);
}
cout << endl << "List: ";
if(print(head)){
cout << endl << endl;
cout << "-----------------------------------------" << endl;
cout << "Note! Enter zero (0) to end the program. " << endl;
input = 1;
while(true){
cout << "Enter a value to be searched: ";
cin >> input;
if(input != 0){
linearSearch(input);
cout << endl << endl;
} else {
cout << "Program exited!";
break;
}
}
}
}